Avoiding Infinite Recursion with Stratified Aspects
نویسندگان
چکیده
Infinite recursion is a known problem of aspect-oriented programming with AspectJ: if no special precautions are taken, aspects advising aspects can easily and unintentionally advise themselves. We present a compiler for an extension of the AspectJ programming language that avoids self reference by associating aspects with levels, and by automatically restricting the scope of pointcuts used by an aspect to join points of lower levels. We report on a case study using our language extension, and provide numbers of the changes necessary for migrating existing applications to it. Our results suggest that we can make programming with AspectJ simpler and safer, without restricting its expressive power unduly.
منابع مشابه
Distribution of complex transmission eigenvalues for spherically stratified media
In this paper, we employ transformation operators and Levinson’s density formula to study the distribution of interior transmission eigenvalues for a spherically stratified media. In particular, we show that under smoothness condition on the index of refraction that there exist an infinite number of complex eigenvalues and there exist situations when there are no real eigenvalues. We also consi...
متن کاملAvoiding large squares in infinite binary words
We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y| ≥ 4; our construction is somewhat simpler than the original construction of Dekking. Second, we construct an infinite binary word avoiding all squares except 0, 1, and (01); our construction is somewhat simpler than the origina...
متن کاملOn the Finite Rank of Bounded Semi-infinite Hankel Operators
Bounded, semi-infinite Hankel matrices of finite rank over the space l of square-summable sequences occur frequently in classical analysis and engineering applications. The notion of finite rank often appears under different contexts and the literature is diverse. The first part of this paper reviews some elegant, classic criteria and establish connections among the various characterizations of...
متن کاملOn the finite rank and finite-dimensional representation of bounded semi-infinite Hankel operators
Bounded, semi-infinite Hankel matrices of finite rank over the space 2 of square-summable sequences occur frequently in classical analysis and engineering applications. The notion of finite rank often appears under different contexts and the literature is diverse. The first part of this paper reviews some elegant, classical criteria and establishes connections among the various characterization...
متن کاملOn the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the physical limit has an operational meaning in agreement with the Abel sums of infinite series. The formal analogies to accelerated (hyper-) computers and the recursion theoretic diagonal methods are discussed. As quantum i...
متن کامل